An Efficient Algorithm for Mining Maximal Sparse Interval from Interval Dataset

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Efficient Branching Algorithm for Interval Completion

We study the interval completion problem, which asks for the insertion of a set of at most k edges to make a graph of n vertices into an interval graph. We focus on chordal graphs with no small obstructions, where every remaining obstruction is known to have a shallow property. From such a shallow obstruction we single out a subset 6 or 7 vertices, called the frame, and 5 missed edges in the su...

متن کامل

An Improvement for Efficiency Interval: Efficient and Inefficient Frontiers

The performances of decision-making units (DMUs) can be evaluated from two different points of view optimistic and pessimistic and accordingly, two different efficiencies can be calculated for each DMU: the best relative efficiency and the worst relative efficiency. In the conventional methods of data envelopment analysis (DEA), only the best relative efficiency is evaluated. It is argued h...

متن کامل

An Efficient Parallel Algorithm for Scheduling Interval Ordered Tasks

We present an efficient parallel algorithm for scheduling n unit length tasks on m identical processors when the precedence graphs are interval orders. Our algorithm requires O(log v + (n logn)/v) time and O(nv + n) operations on the CREW PRAM, where v ≤ n is a parameter. By choosing v = √ n, we obtain an O( √ n logn)-time algorithm with O(n) operations. For v = n/ logn, we have an O(log n)time...

متن کامل

An Efficient Algorithm for Mining Maximal Frequent Item Sets

Problem Statement: In today’s life, the mining of frequent patterns is a basic problem in data mining applications. The algorithms which are used to generate these frequent patterns must perform efficiently. The objective was to propose an effective algorithm which generates frequent patterns in less time. Approach: We proposed an algorithm which was based on hashing technique and combines a ve...

متن کامل

Efficient Trajectory Pattern Mining for both Sparse and Dense Dataset

The comprehension of phenomena related to movement – not only of people and vehicles but also of animals and other moving objects – has always been a key issue in many areas of scientific investigation or social analysis. Many applications track the movement of mobile objects, using locationacquisition technologies such as Global Positioning System (GPS), Global System for Mobile Communications...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal of Computer Applications

سال: 2014

ISSN: 0975-8887

DOI: 10.5120/18838-0374